On Channels with Finite Holevo Capacity

On Channels with Finite Holevo Capacity

On the Complexity of Computing Zero-Error and Holevo Capacity of Quantum Channels

We consider the clique problem in graphs, which is NP-complete, and try to find a quantum analogue of this problem. We show that, quantum clique problem can be defined as follows. Given a quantum channel, are there k states that are distinguishable, with no error, after passing through channel. This definition comes from reconsidering the clique problem in terms of the zero-error capacity of gr...

Holevo Superadditivity Bounds for Heralded Channels

We show that for a particular class of quantum channels, which we call heralded channels, monogamy of squashed entanglement limits the superadditivity of Holevo capacity. Heralded channels provide a means to understand the quantum erasure channel composed with an arbitrary other quantum channel, as well as common situations in experimental quantum information that involve frequent loss of qubit...

A Finite Capacity Priority Queue with Discouragement

In this paper we report on a study of a two level preemptive priority queue with balking and reneging for lower priority level. The inter-arrival and the service times for both levels follow exponential distribution. We use a finite difference equation approach for solving the balance equations of the governing queuing model whose states are described by functions of one independent variable. H...

Capacity-Achieving Schemes for Finite-State Channels

Capacity-Achieving Schemes for Finite-State Channels